On finite simple semigroups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Completely Simple Semigroups

In this paper completely simple semigroups or generalized groups are considered. We characterize generalized groups which are normal generalized groups. Homomorphisms of generalized groups are considered. Equivalent conditions for the kernel of a homomorphism are deduced. We prove that the group components of a generalized group have the same cardinality. We also prove that if G is a finite nor...

متن کامل

On the Graphs Related to Green Relations of Finite Semigroups

In this paper we develop an analog of the notion of the con- jugacy graph of  nite groups for the  nite semigroups by considering the Green relations of a  nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a  nite semigroup S , we  first atte...

متن کامل

Computational Complexity of Checking Identities in 0-simple Semigroups and Matrix Semigroups over Finite Fields

In this paper we analyze the so called word-problem for (finite) combinatorial 0-simple semigroups and matrix semigroups from the viewpoint of computational complexity.

متن کامل

Finite semigroups as categories, ordered semigroups or compact semigroups

The results presented in this section are a good illustration of the following quotation of Marshall Stone [34]: ’A cardinal principle of modern mathematical research may be stated as a maxim: “One must always topologize” ’. Varieties of finite semigroups are a good example where Stone’s principle was applied successfully. Recall that a variety of semigroups is a class of semigroups closed unde...

متن کامل

On Residually Finite Semigroups of Cellullar Automata

We prove that if M is a monoid and A a finite set with more than one element, then the residual finiteness of M is equivalent to that of the monoid consisting of all cellular automata over M with alphabet A.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 1991

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s0013091500007112